Disjunctive form and the modal μ alternation hierarchy
نویسنده
چکیده
This paper studies the relationship between disjunctive form, a syntactic normal form for the modal μ calculus, and the alternation hierarchy. First it shows that all disjunctive formulas which have equivalent tableau have the same syntactic alternation depth. However, tableau equivalence only preserves alternation depth for the disjunctive fragment: there are disjunctive formulas with arbitrarily high alternation depth that are tableau equivalent to alternation-free non-disjunctive formulas. Conversely, there are non-disjunctive formulas of arbitrarily high alternation depth that are tableau equivalent to disjunctive formulas without alternations. This answers negatively the so far open question of whether disjunctive form preserves alternation depth. The classes of formulas studied here illustrate a previously undocumented type of avoidable syntactic complexity which may contribute to our understanding of why deciding the alternation hierarchy is still an open problem.
منابع مشابه
Fixpoint alternation: Arithmetic, transition systems, and the binary tree
We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwiński.
متن کاملAlternation Is Strict For Higher-Order Modal Fixpoint Logic
We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinary parity automata extended by a variation of the Krivine Abstract Machine. We show that the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal μ-calculus. ...
متن کاملThe alternation hierarchy in fixpoint logic with chop is strict too
Fixpoint Logic with Chop extends the modal μ-calculus with a sequential composition operator which results in an increase in expressive power. We develop a game-theoretic characterisation of its model checking problem and use these games to show that the alternation hierarchy in this logic is strict. The structure of this result follows the lines of Arnold’s proof showing that the alternation h...
متن کاملThe μ-calculus alternation hierarchy collapses over structures with restricted connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کاملThe \mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کامل